On Deterministic Finite Automata and Syntactic Monoid Size
نویسندگان
چکیده
We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of n-state (minimal) deterministic finite automata. We show tight upper bounds on the syntactic monoid size, proving that an nstate deterministic finite automaton with singleton input alphabet (input alphabet with at least three letters, respectively) induces a linear (n, respectively) size syntactic monoid. In the case of two letter input alphabet, we can show a lower bound of n − `
منابع مشابه
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semigroups. We show that for every prime n ≥ 7 there exist natural numbers k and ` with n = k + ` such that the semigroup Uk,` is maximal w.r.t. its size among all (transformation) semigroups which can be generated with tw...
متن کاملTowards a Theory of Complexity of Regular Languages
We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language – which is the number of its (left) quotients, and is the same as its state complexity – we also consider the size of its syntactic semigroup and the quotient complexity of its atoms – basic components of every...
متن کاملTopological dynamics and recognition of languages
We define compact automata and show that every language has a unique minimal compact automaton. We also define recognition of languages by compact left semitopological monoids and construct the analogue of the syntactic monoid in this context. For rational languages this reduces to the usual theory of finite automata and finite monoids.
متن کاملOn the interplay between Babai and \v{C}ern\'y's conjectures
Motivated by the Babai conjecture and the Černý conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with n states in this class, we prove that the reset thresholds are upperbounded by 2n − 6n + 5 and can attain the value n(n−1) 2 . In addition, we study diameters of the pair digraphs of permu...
متن کاملSyntactic semigroups
This chapter gives an overview on what is often called the algebraic theory of finite automata. It deals with languages, automata and semigroups, and has connections with model theory in logic, boolean circuits, symbolic dynamics and topology. Kleene’s theorem [70] is usually considered as the foundation of this theory. It shows that the class of recognizable languages (i.e. recognized by finit...
متن کامل